منابع مشابه
The directed almost resolvable Hamilton-Waterloo problem
In this paper, a result is proved that provides a general method of attack that can be used to solve the existence problem for partitions of the directed edges of Dn, the complete directed graph on n. vertices into r and n r almost parallel classes of directed cycles of length m1 and m2 respectively in the case where n\ and, ?rl2 &r€ €v€r. Use of this technique is then demonstrated by essential...
متن کاملA Note on Fuzzy Almost Resolvable Spaces
In this paper we study the conditions under which a fuzzy topological space becomes a fuzzy almost resolvable space and the inter-relations between fuzzy almost resolvable, fuzzy almost irresolvable spaces, fuzzy submaximal spaces, fuzzy first category spaces, fuzzy Baire spaces, fuzzy weakly Volterra spaces are also investigated.
متن کاملEveryH-decomposition ofKnhas a Nearly Resolvable Alternative
Let H be a fixed graph. An H-decomposition of Kn is a coloring of the edges of Kn such that every color class forms a copy of H. Each copy is called a member of the decomposition. The resolution number of an H-decomposition L of Kn, denoted χ(L), is the minimum number t such that the color classes (i.e. the members) of L can be partitioned into t subsets L1, . . . , Lt, where any two members be...
متن کاملAlmost resolvable decompositions of 2Kn into cycles of odd length
The complete graph on n vertices is denoted by K, and the graph on n vertices in which each pair of vertices is joined by exactly 2 edges is denoted by 2K,. An m-cycle is a sequence of m distinct vertices (u1, u2, . . . . u,) such that ui is adjacent to ui+ 1 and U, is adjacent to u1 . A spanning subgraph H of G is a subgraph for which V(H) = V(G). An i-factor of a graph G is a spanning subgrap...
متن کاملExistence of almost resolvable directed 5-cycle systems
A directed k-cycle system of order n is a pair ( S, T ), where S is an n-set and T is a collection of arc disjoint directed k-cycles that partition the complete directed graph Kn *. An almost parallel class with deficiency x is a set of directed k-cycles which form a partition of S \ {x}. An almost resolvable directed k-cyclc system is a directed k-cyclc system in which the cycles can be partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90067-8